Efficient Notification of Meeting Points for Moving Groups via Independent Safe Regions
نویسندگان
چکیده
منابع مشابه
Efficient Construction of Safe Regions for Moving kNN Queries over Dynamic Datasets
The concept of safe region has been used to reduce the computation and communication cost for the continuous monitoring of k nearest neighbor (kNN) queries. A safe region is an area such that as long as a query remains in it, the set of its kNNs does not change. In this paper, we present an efficient technique to construct the safe region by using cheap RangeNN queries. We also extend our appro...
متن کاملAdaptive Safe Regions for Continuous Spatial Queries over Moving Objects
Continuous spatial queries retrieve a set of time-varying objects continuously during a given period of time. However, monitoring moving objects to maintain the correctness of the query results often incurs frequent location updates from these moving objects. To address this problem, existing solutions propose lazy updates, but such techniques generally avoid only a small fraction of all unnece...
متن کاملSafe Arrays via Regions and Dependent Types
Arrays over regions of points were introduced in ZPL in the late 1990s and later adopted in Titanium and X10 as a means of simplifying the programming of high-performance software. A region is a set of points, rather than an interval or a product of intervals, and enables the programmer to write a loop that iterates over a region. While convenient, regions do not eliminate the risk of array bou...
متن کامل-nets for moving points.∗
In this paper, we extend the weak r -net theorem to a kinetic setting where the underlying set of points is moving polynomially with bounded description complexity. We establish that one can find a kinetic analog N of a weak r -net of cardinality O(r d(d+1) 2 log r) whose points are moving with coordinates that are rational functions with bounded description complexity. Moreover, each member of...
متن کاملEfficient Detection of Patterns in 2D Trajectories of Moving Points
Moving point object data can be analyzed through the discovery of patterns in trajectories. We consider the computational efficiency of detecting four such spatio-temporal patterns, namely flock, leadership, convergence, and encounter, as defined by Laube et al., Finding REMO—detecting relative motion patterns in geospatial lifelines, 201–214, (2004). These patterns are large enough subgroups o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2015
ISSN: 1041-4347
DOI: 10.1109/tkde.2014.2334304